Maximum subset intersection
نویسندگان
چکیده
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . . , Au in order to maximize the size of the intersection of the sets. In this paper we present two NP-Hardness proofs, the first via a direct reduction from 3-Sat. The second proof involves a gap-preserving reduction from MaxClique which enables us to show that our problem cannot be approximated within an n1− multiplicative factor, for any > 0, unless NP = ZPP .
منابع مشابه
dominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملON THE SYSTEM OF LEVEL-ELEMENTS INDUCED BY AN L-SUBSET
This paper focuses on the relationship between an $L$-subset and the system of level-elements induced by it, where the underlying lattice $L$ is a complete residuated lattice and the domain set of $L$-subset is an $L$-partially ordered set $(X,P)$. Firstly, we obtain the sufficient and necessary condition that an $L$-subset is represented by its system of level-elements. Then, a new representat...
متن کاملA note on a Maximum k-Subset Intersection problem
Consider the following problem which we call Maximum k-Subset Intersection (MSI): Given a collection C = {S1, . . . , Sm} of m subsets over a finite set of elements E = {e1, . . . , en}, and a positive integer k, the objective is to select exactly k subsets Sj1 , . . . , Sjk whose intersection size |Sj1 ∩ . . . ∩ Sjk | is maximum. In [2], Clifford and Popa studied a related problem and left as ...
متن کاملMore complete intersection theorems
The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families. In recent work, we extended this theorem to the weighted setting, giving the maximum μp measure of a t-intersecting family on n points. In this work, we prove two new complete intersection theorems. The first gi...
متن کاملLine-closed Subsets of Steiner Triple Systems and Classical Linear Spaces 1
A proper non-empty subset C of the points of a linear space S = (P; L) is called line-closed if any two intersecting lines of S , each meeting C at least twice, have their intersection in C. We show that when every line has k points and every point lies on r lines the maximum size for such sets is r + k ? 2. In addition it is shown that this cannot happen for projective spaces PG(n; q) unless q...
متن کاملMaximum patterns in datasets
Given a binary dataset of positive and negative observations, a positive (negative) pattern is a subcube having a nonempty intersection with the positive (negative) subset of the dataset, and an empty intersection with the negative (positive) subset of the dataset. Patterns are the key building blocks in Logical Analysis of Data (LAD), and are an essential tool in identifying the positive or ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 111 شماره
صفحات -
تاریخ انتشار 2011